A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language
نویسنده
چکیده
This paper addresses eecient parsing in the context of logical inference for the purpose of using logic programming languages in compiler writing. A bottom-up, deterministic parsing mechanism is formulated for \bounded right context" grammars, a subclass of LR(k) grammars with characteristics amenable to declarative parser speciica-tion. A working parser generator for Prolog is described, although the basic parsing mechanism is applicable to logic programming in general.
منابع مشابه
A Formulation of Deterministic Bottom - UpParsing and Parser Generation In
This paper addresses eecient parsing in the context of logical inference for the purpose of using logic programming languages in compiler writing. A bottom-up, deterministic parsing mechanism is formulated for \bounded right context" grammars, a subclass of LR(k) grammars with characteristics amenable to declarative parser speciica-tion. A working parser generator for a logic programming langua...
متن کاملDeterministic Parsing of Languages with Dynamic Operators
Allowing the programmer to define operators in a language makes for more readable code but also complicates the job of parsing; standard parsing techniques cannot accommodate dynamic grammars. We present an LR parsing methodology, called deferred decision parsing , that handles dynamic operator declarations, that is, operators that are declared at run time, are applicable only within a program ...
متن کاملAppears in Proceedings of the ICML - 97 Workshop on Automata Induction , Grammatical Inference , and Language Aquicision
For most natural language processing tasks, a parser that maps sentences into a semantic representation is signi cantly more useful than a grammar or automata that simply recognizes syntactically wellformed strings. This paper reviews our work on using inductive logic programming methods to learn deterministic shift-reduce parsers that translate natural language into a semantic representation. ...
متن کاملAppears in Proceedings of the ICML - 97 Workshop on Automata Induction , Grammatical Inference , and Language
For most natural language processing tasks, a parser that maps sentences into a semantic representation is signi cantly more useful than a grammar or automata that simply recognizes syntactically wellformed strings. This paper reviews our work on using inductive logic programming methods to learn deterministic shift-reduce parsers that translate natural language into a semantic representation. ...
متن کاملAn Inductive Logic Programming Method for Corpus-based Parser Construction
Empirical methods for building natural language systems has become an important area of research in recent years. Most current approaches are based on propositional learning algorithms and have been applied to the problem of acquiring broad-coverage parsers for relatively shallow (syntactic) representations. This paper outlines an alternative empirical approach based on techniques from a sub el...
متن کامل